Empirical Evaluation for Graph Drawing
نویسندگان
چکیده
This report documents the program and outcomes of Dagstuhl Seminar 15052 “Empirical Evaluation for Graph Drawing” which took place January 25–30, 2015. The goal of the seminar was to advance the state of the art in experimental evaluation within the wider field of graph drawing, both with respect to user studies and algorithmic experimentation. Seminar January 25–30, 2015 – http://www.dagstuhl.de/15052 1998 ACM Subject Classification E.1 Data Structures: Graphs and Networks, F.2 Analysis of Algorithms and Problem Complexity, G.3 Probability and Statistics: Experimental Design, H.5 Information Interfaces and Presentation
منابع مشابه
Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052)
This report documents the program and outcomes of Dagstuhl Seminar 15052 “Empirical Evaluation for Graph Drawing” which took place January 25–30, 2015. The goal of the seminar was to advance the state of the art in experimental evaluation within the wider field of graph drawing, both with respect to user studies and algorithmic experimentation. Seminar January 25–30, 2015 – http://www.dagstuhl....
متن کاملAlgorithms for Cluster Busting in Anchored Graph Drawing
Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maintain a user’s mental picture of the original layout. We present a new approach to layout adjustment called cluster busting in anchored graph drawing. We then give two algorithms as examples of this approach. The goals o...
متن کاملDesign and Evaluation of the Tightly Coupled Perceptual-Cognitive Tasks in Knowledge Domain Visualization
Knowledge Domain Visualization (KDViz) aims to reveal the dynamics of how knowledge domains evolve over time. It is the ultimate role for information visualization to facilitate a wide variety of user tasks associated with the study of such dynamic, large-scale, transient, and self-organized phenomena. Since the evolution of knowledge domain is necessarily influenced by an array of factors, the...
متن کاملSchool of IT Technical Report A FORCE-DIRECTED METHOD FOR LARGE CROSSING ANGLE GRAPH DRAWING
Recent empirical research has indicated that human graph reading performance improves when crossing angles increase. However, crossing angle has not been used as an aesthetic criterion for graph drawing algorithms so far. In this paper, we introduce a force-directed method that aims to construct graph drawings with large crossing angles. Experiments indicate that our method significantly increa...
متن کاملA Force-Directed Method for Large Crossing Angle Graph Drawing
Recent empirical research has indicated that human graph reading performance improves when crossing angles increase. However, crossing angle has not been used as an aesthetic criterion for graph drawing algorithms so far. In this paper, we introduce a force-directed method that aims to construct graph drawings with large crossing angles. Experiments indicate that our method significantly increa...
متن کامل